The Anatomy of Integers and Permutations

نویسنده

  • Andrew Granville
چکیده

If you switch on your TV in the evening then, as likely as not, you will find yourself watching an episode of a popular detective show (set in various spectacular locations) in which surprisingly dapper forensic scientists turn up evidence using careful anatomical (and other) study so as to be able to identify and prosecute a heinous criminal. Sometimes a flatfooted detective is misled by the surface evidence to suspect one person, but then the forensic team, digging deeper, turns up details that surprise not only the easily misled detective but even you, the astute viewer. For example, two seemingly unrelated corpses are found, and our hapless detective believes that the crimes are unrelated, whereas the forensic investigators turn up conclusive proof that the two corpses were in fact twins. So what would happen if we put together a forensic team to investigate the anatomy of some of the most common mathematical objects, say of integers and permutations? Seems silly at first. Most of our training with these simple mathematical objects involves how they are used in understanding more complicated phenomena, but rarely do we look at their anatomy, the inter-relation of their constituent parts (that is, the prime factors of integers, and the cycles of permutations). So our objective is to be the forensic scientists, with the corpses of these two seemingly unrelated mathematical objects laid out before us, and it is up to us to determine whether there is more in common between the anatomies of integers and permutations than meets the eye. This article is written as a companion piece to [0], a film-script in which we develop the connection with anatomy and forensics to create a fantasy world where forensic detectives (loosely based on famous mathematicians) prove and interpret several of the key notions exposed more precisely herein.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimal Actions of the Group S(z) of Permutations of the Integers

Each topological group G admits a unique universal minimal dynamical system (M(G), G). For a locally compact non-compact group this is a nonmetrizable system with a very rich structure, on which G acts effectively. However there are topological groups for which M(G) is the trivial one point system (extremely amenable groups), as well as topological groups G for which M(G) is a metrizable space ...

متن کامل

Forbidden arithmetic progressions in permutations of subsets of the integers

Permutations of the positive integers avoiding arithmetic progressions of length 5 were constructed in (Davis et al, 1977), implying the existence of permutations of the integers avoiding arithmetic progressions of length 7. We construct a permutation of the integers avoiding arithmetic progressions of length 6. We also prove a lower bound of 1 2 on the lower density of subsets of positive inte...

متن کامل

Permutations with interval cycles

We study permutations of the set [n] = {1, 2, . . . , n} written in cycle notation, for which each cycle forms an increasing or decreasing interval of positive integers. More generally, permutations whose cycle elements form arithmetic progressions are considered. We also investigate the class of generalised interval permutations, where each cycle can be rearranged in increasing order to form a...

متن کامل

A Stream Cipher Based on Chaotic Permutations

In this paper we introduce a word-based stream cipher consisting of a chaotic part operating as a chaotic permutation and a linear part, both of which designed on a finite field. We will show that this system can operate in both synchronized and self-synchronized modes. More specifically, we show that in the self-synchronized mode the stream cipher has a receiver operating as an unknown input o...

متن کامل

Sets of permutations that generate the symmetric group pairwise

The paper contains proofs of the following results. For all sufficiently large odd integers n, there exists a set of 2n−1 permutations that pairwise generate the symmetric group Sn. There is no set of 2n−1 + 1 permutations having this property. For all sufficiently large integers n with n≡ 2 mod 4, there exists a set of 2n−2 even permutations that pairwise generate the alternating group An. The...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008